from typing import List, Tuple
def possible_capacity(n: int, e: List[Tuple[str, str]]) -> int:
id_number = []
count = 0
reader = 0
for sign, id in e:
if sign == '+':
id_number.append(id)
reader += 1
else:
if id in id_number:
id_number.remove(id)
reader -= 1
else:
count += 1
count = max(count, reader)
return count
n = int(input())
a = []
for i in range(n):
b,c = input().split()
a.append((b, c))
d = possible_capacity(n, a)
print(d)
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int present=0;
int max=0;
map<int,int> m;
for(int i=0;i<n;i++){
char sign;
int id;
cin>>sign>>id;
if(sign=='+'){
present++;
m[id]=1;
if(present>max) max=present;
}
if(sign=='-'){
if(m.find(id)!=m.end()){
present--;
m[id]=0;
}
else max++;
}
}
cout<<max<<'\n';
return 0;
}
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |